منابع مشابه
Review of Dynamic Logic ∗ Riccardo
In the 1960s, as programming languages were being used to write larger programs, those programs became harder to understand, and people began to worry about issues such as correctness, that is, determining whether a program computed what it was supposed to compute. As a consequence, researchers started to look into the pragmatics of programming, leading among others to a criticism of the GOTO s...
متن کاملNonlinear control design : By Riccardo Marino and Patrizio Tomei
Nonlinear control theory has received considerable attention m the last decades. As a result, there exists nowadays a sophisticated framework using (differential) geometric methods for dealmg with a large number of controller design problems. The book under review, Nonlinear Control Design, Geometric, Adaptiue and Robust presents according to the back cover of the book “A self-contained introdu...
متن کاملInvariantly Universal Analytic Quasi - Orders Riccardo
We introduce the notion of an invariantly universal pair (S, E) where S is an analytic quasi-order and E ⊆ S ∩S is an analytic equivalence relation. This means that for any analytic quasi-order R there is a Borel set B invariant under E such that R is Borel equivalent to the restriction of S to B. We prove a general result giving a sufficient condition for invariant universality, and we demonst...
متن کاملRiccardo Manzotti An Alternative View of Conscious Perception
I present a view of conscious perception that supposes a processual unity between the activity in the brain and the perceived event in the external world. I use the rainbow to provide a first example, and subsequently extend the same rationale to more complex examples such as perception of objects, faces and movements. I use a process-based approach as an explanation of ordinary perception and ...
متن کاملMinimum Feedback Vertex Set in k - Dimensional Hypercubes Riccardo
In this paper we nd upper and lower bounds to the size of the feedback vertex set for k-dimensional hypercubes. Given a graph, the minimum feedback vertex set problem consists of nding a subset of vertices of minimum size whose removal induces an acyclic subgraph. The problem is NP-hard for general networks 2], but interesting polynomial solutions have been found for particular
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 2019
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.1902399116